Real-time Generalization of Point Data in Mobile and Web Mapping Using Quadtrees

نویسندگان

  • Pia Bereuter
  • Robert Weibel
چکیده

With a focus on mobile and web mapping, we propose several algorithms for on-the-fly generalization of point data, such as points of interest (POIs) or large point collections. In order to achieve real-time performance we use a quadtree data structure. With their hierarchical subdivision structure and progressive levels of detail, indices of the quadtree family lend themselves as auxiliary data structures to support algorithms for generalization operations, including selection, simplification, aggregation, and displace-ment of point data. The spatial index can further be used to generate several local and global measures that can then serve to make educated guesses on the density and prox-imity of points across map scales, and thus enable control of the operation of the general-ization algorithms. An implementation of the proposed algorithms has shown that thanks to the quadtree index, real-time performance can be achieved even for large point sets. Furthermore, the quadtree data structure can be extended into a caching structure, which can be used to store pre-computed generalizations; thus, a desired level of detail can simply be retrieved from cache. DOI: https://doi.org/10.1080/15230406.2013.779779 Posted at the Zurich Open Repository and Archive, University of Zurich ZORA URL: https://doi.org/10.5167/uzh-87984 Accepted Version Originally published at: Bereuter, Pia; Weibel, Robert (2013). Real-time generalization of point data in mobile and web mapping using quadtrees. Cartography and Geographic Information Science, 40(4):271-281. DOI: https://doi.org/10.1080/15230406.2013.779779 Real-time Generalization of Point Data in Mobile and Web Mapping Using Quadtrees Pia Bereuter* and Robert Weibel Department of Geography University of Zurich Winterthurerstrasse 190

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algorithms for On-the-Fly Generalization of Point Data Using Quadtrees

With a focus on mobile and web mapping, we propose several algorithms for on-the-fly generalization of point data, such as points of interest (POIs) or large point collections. In order to achieve real-time performance we use a quadtree. With their hierarchical structure and progressive levels of detail, indexes of the quadtree family lend themselves as auxiliary data structures to support algo...

متن کامل

Design and Evaluation of a Method for Partitioning and Offloading Web-based Applications in Mobile Systems with Bandwidth Constraints

Computation offloading is known to be among the effective solutions of running heavy applications on smart mobile devices. However, irregular changes of a mobile data rate have direct impacts on code partitioning when offloading is in progress. It is believed that once a rate-adaptive partitioning performed, the replication of such substantial processes due to bandwidth fluctuation can be avoid...

متن کامل

Estimating the Real Capacity of Rain Erosion Using GIS (The Fournier Case Study for Isfahan)

Interpolation, the generalization of point data to scatter data, and combining maps are three cases of important applications of GIS. In this study, it has been tried to make the estimation of rain erosion capacity (Fournier Method) more real through using GIS capability in interpolation and the generalization of point data to scatter data. In Fournier method, the rain erosion capacity is calcu...

متن کامل

High Fuzzy Utility Based Frequent Patterns Mining Approach for Mobile Web Services Sequences

Nowadays high fuzzy utility based pattern mining is an emerging topic in data mining. It refers to discover all patterns having a high utility meeting a user-specified minimum high utility threshold. It comprises extracting patterns which are highly accessed in mobile web service sequences. Different from the traditional fuzzy approach, high fuzzy utility mining considers not only counts of mob...

متن کامل

Dynamic smooth compressed quadtrees (Fullversion)

We introduce dynamic smooth (a.k.a. balanced) compressed quadtrees with worst-case constant time updates in constant dimensions. We distinguish two versions of the problem. First, we show that quadtrees as a space-division data structure can be made smooth and dynamic subject to split and merge operations on the quadtree cells. Second, we show that quadtrees used to store a set of points in R c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017